The maximum sum of degrees above a threshold in planar graphs
نویسندگان
چکیده
منابع مشابه
The maximum sum of degrees above a threshold in planar graphs
We consider the maximum sum of the degrees of vertices with degree at least k in any simple planar graph on n vertices. West and Will solved this for k 12 and n m k and gave bounds for 6 k 11. Here we complete the solution by constructing graphs achieving the bounds for all n m k when k 11.
متن کاملVertex Degrees in Planar Graphs
For a planar graph on n vertices we determine the maximum values for the following: 1) the sum of the m largest vertex degrees. 2) the number of vertices of degree at least k. 3) the sum of the degrees of vertices with degree at least k.
متن کاملM-degrees of quadrangle-free planar graphs
The M-degree of an edge xy in a graph is the maximum of the degrees of x and y. The M-degree of a graph G is the minimum over M-degrees of its edges. In order to get upper bounds on the game chromatic number, He et al showed that every planar graph G without leaves and 4cycles has M-degree at most 8 and gave an example of such a graph with M-degree 3. This yields upper bounds on the game chroma...
متن کاملThe maximum degree of random planar graphs
McDiarmid and Reed [‘On the maximum degree of a random planar graph’, Combin. Probab. Comput. 17 (2008) 591–601] showed that the maximum degree Δn of a random labeled planar graph with n vertices satisfies with high probability (w.h.p.) c1 logn < Δn < c2 logn, for suitable constants 0 < c1 < c2. In this paper, we determine the precise asymptotics, showing in particular that w.h.p. |Δn − c logn|...
متن کاملThe maximum degree of planar graphs I. Series-parallel graphs
We prove that the maximum degree ∆n of a random series-parallel graph with n vertices satisfies ∆n/ log n → c in probability, and E∆n ∼ c log n for a computable constant c > 0. The same result holds for outerplanar graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1997
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(96)00116-1